Noureddine Bouhmala
نویسنده
چکیده
The satisfiability problem (SAT) which is known to be NP-complete (7) plays a central role problem in many applications in the fields of VLSI Computer-Aided design, Computing Theory, and Artificial Intelligence. Generally, a SAT problem is defined as follows. A propositional formula Φ = ∧m j=1 Cj with m clauses and n Boolean variables is given. Each Boolean variable, xi, i ∈ {1, . . . , n}, takes one of the two values, True or False. A clause , in turn, is a disjunction of literals and a literal is a variable or its negation. Each clause Cj has the form:
منابع مشابه
A Multilevel Greedy Algorithm for the Satisfiability Problem
The satisfiability (SAT) problem is known to be NP-complete [3] and plays a central role in many domains such as computer-aided design, computing theory, and artificial intelligence. Generally, a SAT problem is defined as follows. Given a propositional formula with m clauses and n boolean variables, where each variable has value of either True or False. Negation of boolean variable xi is denote...
متن کاملStochastic Learning for SAT- Encoded Graph Coloring Problems
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random wal...
متن کاملMemetic Algorithm for Sat-encoded Industrial Problems: a Statistical Comparison
In this work, a hierarchical population-based memetic algorithm for solving the satisfiability problem is presented. The approach suggests looking at the evolution as a hierarchical process evolving from a coarse population where the basic unit of a gene is composed of cluster of variables that represent the problem to a fine population where each gene represents a single variable. The optimiza...
متن کاملPartition of Unstructured Finite Element Meshes by a Multilevel Approach
We consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular, we propose a new heuristic for matching the vertices of a graph during the coarsening phase. We compare our heuristic with two ...
متن کاملGSAT Enhanced with Learning Automata and Multilevel Paradigm
A large number of problems that occur in knowledgerepresentation, learning, very large scale integration technology (VLSI-design), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. The growing need for more efficient and scalable a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012